On Color Image Quantization by the K-Means Algorithm

نویسنده

  • Henryk Palus
چکیده

In this paper we show the main properties of k-means algorithm as a tool for color image quantization. All experiments have been carried out on color images with different number of unique colors and different colorfulness. We have tested the influence of methods of determination of initial cluster centers, of choice of distance metric, of choice of color space. In our tests we have used two dimensions of palette (256,16) and three different measures for quantization errors. The results of k-means technique have been compared with quantized images from commercial programs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Approach for Color Image Quantization Using K-means and Firefly Algorithms

Color Image quantization (CQ) is an important problem in computer graphics, image and processing. The aim of quantization is to reduce colors in an image with minimum distortion. Clustering is a widely used technique for color quantization; all colors in an image are grouped to small clusters. In this paper, we proposed a new hybrid approach for color quantization using firefly algorithm (FA) a...

متن کامل

A Robust Color Image Quantization Algorithm Based on Knowledge Reuse of K-MeansClustering Ensemble

This paper presents a novel color image quantization algorithm. This algorithm improves color image quantization stability and accuracy using clustering ensemble. In our approach, we firstly adopt manifold single k-means clusterings for the color image to form a preliminary ensemble committee. Then, in order to avoid inexplicit correspondence among clustering groups, we use the original color v...

متن کامل

Fast Color Quantization Using Weighted Sort-Means Clustering

Color quantization is an important operation with numerous applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms. However, despite its popularity as a general purpose clustering algorithm, K-means has not received much respect in the color quantization literature because of its high computational requirements and sensitivity...

متن کامل

Color Image Quantization Algorithm Based on Self-Adaptive Differential Evolution

Differential evolution algorithm (DE) is one of the novel stochastic optimization methods. It has a better performance in the problem of the color image quantization, but it is difficult to set the parameters of DE for users. This paper proposes a color image quantization algorithm based on self-adaptive DE. In the proposed algorithm, a self-adaptive mechanic is used to automatically adjust the...

متن کامل

Enhancing Content-based Image Retrieval using Moving K-Means Clustering Algorithm

In this paper, new content-based image retrieval (CBIR) system based on color and shape feature combining with clustering concept that considers the similarities among images in database is proposed. Firstly, the color space of an image is quantized with 128 bin quantization and then color histogram is extracted from the quantized image. Secondly, the shape feature is extracted using horizontal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004